-
1 computable functional
Большой англо-русский и русско-английский словарь > computable functional
-
2 computable functional
Математика: вычислимый функционал -
3 computable functional
English-Russian scientific dictionary > computable functional
-
4 partially computable functional
Математика: частично вычислимый функционалУниверсальный англо-русский словарь > partially computable functional
-
5 partially computable functional
English-Russian scientific dictionary > partially computable functional
-
6 functional
1) матем. оператор; функционал2) технически целесообразный, функциональный•- maximum likelihood functional - metrically bounded functional - metrically unbounded functional - monotonic functional - partially computable functional - strongly undefined functional - uniformly quasiconvex functional - weakly differentiable functional -
7 вычислимый функционал
Большой англо-русский и русско-английский словарь > вычислимый функционал
-
8 model
1) макет; модель || моделировать2) образец4) модель, тип ( изделия)5) шаблон•- countably saturated model - countably uniform model - coupled channels model - finite state model - finitely generated model - game-theory model - random trial increment model - random walk model - sampling model -
9 representation
1) изображение2) отображение; представление•- completely irreducible representation - completely reduced representation - completely reducible representation - discrete representation - finitely related representation - identity representation - locally constant representation - locally faithful representation - strongly rational representation - totally reducible representation -
10 sequence
1) очерёдность; порядок следования3) геол. стратиграфический разрез4) серия, комплекс•- absolutely divergent sequence - absolutely limited sequence - absolutely summable sequence - absolutely unbiased sequence - adjusted homology sequence - asymptotically convergent sequence - asymptotically isotropic sequence - asymptotically lattice sequence - compactly divergent sequence - completely reversible sequence - conditionally divergent sequence - decimal geometric sequence - delicately divergent sequence - discretely convergent sequence - essentially convergent sequence - essentially finite sequence - essentially periodic sequence - everywhere dense sequence - infinitely large sequence - infinitely proceeding sequence - infinitely small sequence - integral stationary sequence - inverse sequence - inverted sequence - linearly independent sequence - locally convergent sequence - metrically convergent sequence - metrically transitive sequence - monotonically decreasing sequence - monotonically increasing sequence - never increasing sequence - numerical sequence - projectively realizable sequence - properly divergent sequence - rapid acquisition sequence - rapidly decreasing sequence - rapidly increasing sequence - recursively defined sequence - recursively divergent sequence - recursively enumerable sequence - relatively compact sequence - sequence of prime numbers - sequence of principal indices - slowly decreasing sequence - slowly increasing sequence - slowly oscillating sequence - stochastically compact sequence - stochastically stable sequence - strictly increasing sequence - strictly measurable sequence - strictly monotonic sequence - strongly convergent sequence - strongly downward sequence - strongly stationary sequence - strongly summable sequence - totally increasing sequence - totally monotone sequence - two-taile sequence - two-way infinite sequence - unconditionally divergent sequence - uniformly divergent sequence - uniformly integrable sequence - weakly convergent sequence
См. также в других словарях:
Computable analysis — In mathematics, computable analysis is the study of which parts of real analysis and functional analysis can be carried out in a computable manner. It is closely related to constructive analysis. Basic results The computable real numbers form a… … Wikipedia
Programming language for Computable Functions — The Programming language for Computable Functions, or PCF, is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Functions (LCF) by Dana Scott. It can be considered as a simplified version of… … Wikipedia
Systemic functional grammar — (SFG) or systemic functional linguistics (SFL) is a model of grammar that was developed by Michael Halliday in the 1960s. [http://www.isfla.org/Systemics/Definition/definition.html, accessed 30 July 2008] It is part of a broad social semiotic… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Economic model — A diagram of the IS/LM model In economics, a model is a theoretical construct that represents economic processes by a set of variables and a set of logical and/or quantitative relationships between them. The economic model is a simplified… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
